Graph operations - PDFSEARCH.IO - Document Search Engine

Graph operations
Results: 797

#	Item
631	M PRA Munich Personal RePEc Archive A network analysis of cities hosting ICT R&D Daniel Nepelski and Giuditta De Prato Add to Reading List Source URL: mpra.ub.uni-muenchen.de Language: English - Date: 2013-02-15 07:49:36 Networks Operations research Network analysis Algebraic graph theory Centrality Theoretical computer science Betweenness centrality Research and development Internationalization Network theory Graph theory Mathematics
632	1 Excercise[removed]Consider the complete graph K4 with four vertices; all vertices are connected by an edge to all other vertices. Suppose now we flip an unbiased coin for each Add to Reading List Source URL: www.trancethrust.nl Language: English - Date: 2012-05-06 05:29:24 Matroid theory Graph operations Graph Planar graphs Connectivity Edge coloring Pseudoforest Graph theory Mathematics Graph coloring
633	Odd Hole Recognition in Graphs of Bounded Clique Size Michele Conforti Dipartimento di Matematica Pura ed Applicata Universit`a di Padova Via Belzoni 7, 35131 Padova, Italy [removed] Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2005-08-26 10:30:44 Clique Neighbourhood Rado graph Graph operations Graph theory Graph Vertex
634	Even-Hole-Free Graphs Part I: Decomposition Theorem Michele Conforti y Gerard Cornuejols Ajai Kapoor Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2001-04-20 18:46:28 Induced path Line graph Graph Tree Perfect graph Path decomposition Decomposition method Graph theory Graph operations Chordal graph
635	Perfect Graphs, Partitionable Graphs and Cutsets Michele Conforti Gerard Cornuejols y Grigor Gasparyan z and Kristina Vuskovic x Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2000-09-19 18:20:11 Line graph Clique Perfect graph Bipartite graph Matching NP-complete problems Combinatorial optimization Tree decomposition Graph structure theorem Graph theory Graph operations Chordal graph
636	3-Steiner Simplicial Elimination Orderings Iain Crump∗and Ortrud R. Oellermann† University of Winnipeg, 515 Portage Avenue Winnipeg, MB R3B 2E9, Canada e-mail: [removed] Add to Reading List Source URL: ion.uwinnipeg.ca Language: English - Date: 2010-09-24 15:00:12 Graph Greedy coloring Tree Neighbourhood Lexicographic breadth-first search End Induced path Cograph Hypergraph Graph theory Graph operations Chordal graph
637	How tight is the corner relaxation? Insights gained from the stable set problem G´erard Cornu´ejolsa,1 , Carla Michinib,2,∗, Giacomo Nannicinic,3 a Tepper School of Business, Carnegie Mellon University, Pittsburgh, Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2012-02-13 11:38:14 Combinatorial optimization Operations research Relaxation Convex optimization Linear programming relaxation Linear programming Cutting-plane method Graph Matching Mathematical optimization Mathematics Graph theory
638	Early Estimates of the Size of Branch-and-Bound Trees G´erard Cornu´ejols∗, Miroslav Karamanov†, Yanjun Li‡ 23th April[removed]Abstract Add to Reading List Source URL: integer.tepper.cmu.edu Language: English - Date: 2004-04-29 18:10:17 Graph theory Operations research Theoretical computer science Backtracking Pattern matching Binary tree B-tree Algorithm Branch and bound Mathematics Search algorithms Applied mathematics
639	CHAPTER 1 Eigenvalues and the Laplacian of a graph 1.1. Introduction Spectral graph theory has a long history. In the early days, matrix theory and linear algebra were used to analyze adjacency matrices of graphs. Algeb Add to Reading List Source URL: www.math.ucsd.edu Language: English - Date: 2010-04-12 15:57:40 Algebraic graph theory Linear algebra Graph operations Adjacency matrix Matrices Eigenvalues and eigenvectors Spectral graph theory Expander graph Bipartite graph Graph theory Mathematics Algebra
640	Hyperplane Annealing and Activator-Inhibitor-Systems Add to Reading List Source URL: tlausser.com Language: English - Date: 2001-11-28 19:57:18 NP-complete problems Operations research Mathematical optimization Simulated annealing Relaxation Combinatorial optimization Travelling salesman problem Graph coloring Annealing Theoretical computer science Mathematics Applied mathematics

UPDATE